Consistent Nonparametric Estimation of NARX Systems Using Convex Optimization, Report no. LiTH-ISY-R-2721
نویسندگان
چکیده
In this paper, a nonparametric method based on quadratic programming (QP) for identification of nonlinear autoregressive systems with exogenous inputs (NARX systems) is presented. We consider a mixed parametric/nonparametric model structure. The output is assumed to be the sum of a parametric linear part and a nonparametric Lipschitz continuous part. The consistency of the estimator is shown assuming only that an upper bound on the true Lipschitz constant is given. In addition, different types of prior knowledge about the system can easily be incorporated. Examples show that the method can give accurate estimates also for small data sets and that the estimate of the linear part sometimes can be improved compared to the linear least squares estimate.
منابع مشابه
Robust finite-frequency H2 analysis, Report no. LiTH-ISY-R-2973
Finite-frequency H2 analysis is relevant to a number of problems in which a priori information is available on the frequency domain of interest. This paper addresses the problem of analyzing robust finite-frequency H2 performance of systems with structured uncertainties. An upper bound on this measure is provided by exploiting convex optimization tools for robustness analysis and the notion of ...
متن کاملDirect Weight Optimization Applied to Discontinuous Functions, Report no. LiTH-ISY-R-2861
The Direct Weight Optimization (DWO) approach is a nonparametric estimation approach that has appeared in recent years within the eld of nonlinear system identi cation. In previous work, all function classes for which DWO has been studied have included only continuous functions. However, in many applications it would be desirable also to be able to handle discontinuous functions. Inspired by th...
متن کاملSuboptimal model reduction using LMIs with convex constraints, Report no. LiTH-ISY-R-2759
An approach to model reduction of LTI systems using Linear Matrix Inequalities (LMIs) in an H∞ framework is presented, where non-convex constraints are replaced with stricter convex constraints thus making it suboptimal. The presented algorithms are compared with the Optimal Hankel reduction algorithm, and are shown to achieve better results (i.e lower H∞-errors) in cases where some of the Hank...
متن کاملHandling Certain Structure Information in Subspace Identification, Report no. LiTH-ISY-R-2890
The prediction-error approach to parameter estimation of linear models often involves solving a non-convex optimization problem. In some cases, it is therefore difficult to guarantee that the global optimum will be found. A common way to handle this problem is to find an initial estimate, hopefully lying in the region of attraction of the global optimum, using some other method. The prediction-...
متن کاملGrey-box identification based on horizon estimation and nonlinear optimization, Report no. LiTH-ISY-R-2963
In applications of (nonlinear) model predictive control a more and more common approach for the state estimation is to use moving horizon estimation, which employs (nonlinear) optimization directly on a model for a whole batch of data. This paper shows that horizon estimation may also be used for joint parameter estimation and state estimation, as long as a bias correction based on the Kalman f...
متن کامل